|
![](/i/fill.gif) |
Invisible wrote:
> Exhibit B: Rule 30 can be stated in 8 equations. Oh, did I mention? It's
> Turing-complete. It can compute any computable function.
You know, he says that, but I'm pretty sure a CA with an infinite amount of
initialization counts as Turing-equivalent.
--
Darren New, San Diego CA, USA (PST)
Forget "focus follows mouse." When do
I get "focus follows gaze"?
Post a reply to this message
|
![](/i/fill.gif) |